- 综合排序
- 最热优先
- 最新优先
- 来自专栏AngelNI
2048 Game
2048 Game 题目链接 A. 2048 Game time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You are playing a variation of game 2048. You have to determine if you can win this game. You have to answer qq independent queries.
1.2K20发布于 2020-04-16 - 来自专栏Ga1@xy's W0r1d
Final Game
发现关键字the eighth circle of Hell，Google这个可以发现是和《神曲》有关，而且搜索到的第一条就是
1.1K10编辑于 2023-04-25 - 来自专栏测试开发架构之路
GAME PROGRAMM
SetConsoleTextAttribute consolehwnd = GetStdHandle(STD_OUTPUT_HANDLE); GetStdHandle(nStdHandle)//是返回标准的输入、输出或错误的设备的句柄，也就是获得输入、输出/错误的屏幕缓冲区的句柄。 system #include <stdlib.h> #include <stdio.h> int main(void) { printf("About to spawn and run a DOS command\n"); s
720130发布于 2018-04-03 BUUCTF Game 1
1、在网站源代码index.html中，发现经过Base32加密后的密文：ON2WG5DGPNUECSDBNBQV6RTBNMZV6RRRMFTX2===
16121编辑于 2025-10-14- 来自专栏calmound
Kindergarten Counting Game
水题：判断单词有几个 刚开始没仔细想 仅仅判断了空格和空格的个数+1就是单词的个数，后来wa后仔细读读，他说连续的字母是一个单词所以abc！abc这就是两个单词了，还有uva不支持子啊循环中定义变量 #include<stdio.h> char str[500]; int Find(int t) { int i; for (i=t;str[i];i++) { if((str[i]>='A' && str[i]<='Z') || (str[i]>='a' && st
67050发布于 2018-04-11 - 来自专栏全栈程序员必看
Flipping Game（枚举）
Flipping Game time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Iahub got bored, so he invented a game to The goal of the game is that after exactly one move to obtain the maximum number of ones. Write a program to solve the little game of Iahub.
43620编辑于 2022-07-07 - 来自专栏全栈程序员必看
LeetCode – Jump Game
一開始想DP一步步迭代更新，求出跳到最后一个的最小步数，可是时间复杂度O(nk)，会超时。
34130编辑于 2022-07-13 - 来自专栏HansBug's Lab
2102: The Trough Game
2102: [Usaco2010 Dec]The Trough Game Time Limit: 10 Sec Memory Limit: 64 MB Submit: 117 Solved: 84
87770发布于 2018-04-10 - 来自专栏Reck Zhang
LeetCode 0390 - Elimination Game
Elimination Game Desicription There is a list of sorted integers from 1 to n.
47220发布于 2021-08-11 - 来自专栏Reck Zhang
LeetCode 0289 - Game of Life
Game of Life Desicription According to the Wikipedia’s article: “The Game of Life, also known simply
43220发布于 2021-08-11 - 来自专栏数据结构与算法
codechef Table Game(博弈)
maya这题我前前后后 断断续续的做了一个星期才A掉。CC一场challenge出两道打表题可有点过分了啊。。
48010发布于 2018-09-17 - 来自专栏Reck Zhang
LeetCode 0055 - Jump Game
Jump Game Desicription Given an array of non-negative integers, you are initially positioned at the first
43240发布于 2021-08-11 - 来自专栏机器学习入门
679. 24 Game
LWC 50：679. 24 Game Problem: You have 4 cards each containing a number from 1 to 9.
35960发布于 2019-05-26 - 来自专栏Reck Zhang
LeetCode 0174 - Dungeon Game
Dungeon Game Desicription The demons had captured the princess (P) and imprisoned her in the bottom-right
40640发布于 2021-08-11 - 来自专栏算法修养
FZU Moon Game(几何)
Memory Limit : 32768 KB Problem Description Fat brother and Maze are playing a kind of special (hentai) game
82450发布于 2018-04-26 - 来自专栏小樱的经验随笔
HDU 5882 Balanced Game
Balanced Game Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total ): 508 Accepted Submission(s): 428 Problem Description Rock-paper-scissors is a zero-sum hand game Given an integer N, representing the count of shapes in a game. You need to find out if there exist a rule to make this game balanced. If A defeats B, B defeats C, and C defeats A, this game is balanced.
93890发布于 2018-04-08 - 来自专栏计算机视觉与深度学习基础
Leetcode 174 Dungeon Game
The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially positioned in the top-left room and must fight his way th
1K60发布于 2018-01-12 - 来自专栏程序编程之旅
HDOJ 1846 Brave Game
今天，大家选择上机考试，就是一种勇敢（brave）的选择；这个短学期，我们讲的是博弈（game）专题；所以，大家现在玩的也是“勇敢者的游戏”，这也是我命名这个题目的原因。 巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流从这堆物品中取物，规 定每次至少取一个，最多取m个。最后取光者得胜。
39310发布于 2021-01-20 - 来自专栏计算机视觉与深度学习基础
Leetcode 55 Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index. For example: A =
536100发布于 2018-01-12 - 来自专栏饶文津的专栏
【POJ 2484】A Funny Game
Description Alice and Bob decide to play a funny game. At the beginning of the game they pick n(1 <= n <= 10 6) coins in a circle, as Figure 1 shows. Suppose that both Alice and Bob do their best in the game. You are to write a program to determine who will finally win the game. Output For each test case, if Alice win the game,output "Alice", otherwise output "Bob".
62810发布于 2020-05-31
腾讯云开发者
Copyright © 2013 - 2026 Tencent Cloud. All Rights Reserved. 腾讯云 版权所有
深圳市腾讯计算机系统有限公司 ICP备案/许可证号：粤B2-20090059 
粤公网安备44030502008569号
腾讯云计算（北京）有限责任公司 京ICP证150476号 | 京ICP备11018762号